Common neighbour structure and similarity intensity in complex networks
نویسندگان
چکیده
منابع مشابه
Iterative Neighbour-Information Gathering for Ranking Nodes in Complex Networks
Designing node influence ranking algorithms can provide insights into network dynamics, functions and structures. Increasingly evidences reveal that node's spreading ability largely depends on its neighbours. We introduce an iterative neighbourinformation gathering (Ing) process with three parameters, including a transformation matrix, a priori information and an iteration time. The Ing process...
متن کاملAssessing Low-Intensity Relationships in Complex Networks
Many large network data sets are noisy and contain links representing low-intensity relationships that are difficult to differentiate from random interactions. This is especially relevant for high-throughput data from systems biology, large-scale ecological data, but also for Web 2.0 data on human interactions. In these networks with missing and spurious links, it is possible to refine the data...
متن کاملStructure-semantics interplay in complex networks and its effects on the predictability of similarity in texts
The classification of texts has become a major endeavor with so much electronic material available, for it is an essential task in several applications, including search engines and information retrieval. There are different ways to define similarity for grouping similar texts into clusters, as the concept of similarity may depend on the purpose of the task. For instance, in topic extraction si...
متن کاملNeighbour Discovery in Active Networks
Active networks consist of traditional routers and active network nodes (ANN). Some aspects of active networks operation, e.g. security and interoperability, require each ANN to know its neighbour ANNs. However, neighbour ANNs are not directly connected, i.e. there may be one or more plain routers between them. This makes the discovery of neighbour ANNs a non trivial task and fundamentally diff...
متن کاملComment on “self-similarity of complex networks”
Many complex networks exhibit a scale-free, power-law distribution of vertex degrees. This common feature is a consequence of two generic mechanisms relating to the formation of real networks: (i) Networks tend to expand over time through the addition of new vertices, and (ii) New vertices attach preferentially to those that are already well connected. We show that for many natural or man-made ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters A
سال: 2017
ISSN: 0375-9601
DOI: 10.1016/j.physleta.2017.08.050